Generating connected acyclic digraphs uniformly at random
نویسندگان
چکیده
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non necessarily connected.
منابع مشابه
Random Generation of Dags for Graph Drawing
The Graph Drawing community uses test suites for comparing layout quality and e ciency. Those suites often claim to collect randomly generated graphs, although in most cases randomness is a loosely de ned notion. We propose a simple algorithm for generating acyclic digraphs with a given number of vertices uniformly at random. Applying standard combinatorial techniques, we describe the overall s...
متن کاملEnumerative applications of a decomposition for graphs and digraphs
A simple decomposition for graphs yields generating functions for counting graphs by edges and connected components. A change of variables gives a new interpretation to the Tutte polynomial of the complete graph involving inversions of trees. The relation between the Tutte polynomial of the complete graph and the inversion enumerator for trees is generalized to the Tutte polynomial of an arbitr...
متن کاملThe graph structure of a deterministic automaton chosen at random: full version
A deterministic finite automaton (dfa) of n states over a k-letter alphabet can be seen as a digraph with n vertices which all have exactly k labeled out-arcs (k-out digraph). In 1973 Grusho [16] first proved that with high probability (whp) in a random k-out digraph there is a strongly connected component (scc) of linear size that is reachable from all vertices, i.e., a giant. He also proved t...
متن کاملRandom sampling of minimally cyclic digraphs with given imbalance sequence
The imbalance of a vertex v in a digraph D is defined as a(v) = d + (v)−d − (v), where d + (v) and d − (v) respectively denote the outdegree and indegree of vertex v. The imbalance sequence of D is formed by listing vertex imbalances in nondecreasing order. We define a minimally cyclic digraph as a connected digraph which is either acyclic or has exactly one oriented cycle whose removal disconn...
متن کاملAlgorithms for generating convex sets in acyclic digraphs
A set X of vertices of an acyclic digraph D is convex if X ̸= ∅ and there is no directed path between vertices of X which contains a vertex not in X. A set X is connected if X ̸= ∅ and the underlying undirected graph of the subgraph ofD induced byX is connected. Connected convex sets and convex sets of acyclic digraphs are of interest in the area of modern embedded processor technology. We constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 90 شماره
صفحات -
تاریخ انتشار 2004